Clique Is Hard on Average for Regular Resolution
نویسندگان
چکیده
منابع مشابه
Clique Is Hard on Average for Regular Resolution (Extended Abstract)
We prove that for k ≪ 4 √n regular resolution requires length nΩ(k ) to establish that an Erdős–Rényi graph with appropriately chosen edge density does not contain a k-clique. This lower bound is optimal up to the multiplicative constant in the exponent, and also implies unconditional nΩ(k ) lower bounds on running time for several state-of-the-art algorithms for finding maximum cliques in graphs.
متن کاملClique is hard to approximate within n
We prove that, unless any problem in NP can be solved in probabilistic polynomial time, for any ǫ > 0, the size of the largest clique in a graph with n nodes is hard to approximate in polynomial time within a factor n. This is done by constructing, for any δ > 0, a probabilistically checkable proof for NP which uses logarithmic randomness and δ amortized free bits.
متن کاملFinding Large Clique Minors is Hard
We prove that it is NP-complete, given a graph G and a parameter h, to determine whether G contains a complete graph Kh as a minor. Submitted: June 2008 Reviewed: April 2009 Revised: May 2009 Accepted: July 2009 Final: July 2009 Published: July 2008 Article type: Concise paper Communicated by: G. Liotta Research supported in part by NSF grant 0830403 and by the Office of Naval Research under gr...
متن کاملReal Anaphora Resolution is Hard .
We introduce a system for anaphora resolution for German that uses various resources in order to develop a real system as opposed to systems based on idealized assumptions, e.g. the use of true mentions only or perfect parse trees and perfect morphology. The components that we use to replace such idealizations comprise a full-fledged morphology, a Wikipedia-based named entity recognition, a rul...
متن کاملImproving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms
The classic algorithm of Viterbi computes the most likely path in a Hidden Markov Model (HMM) that results in a given sequence of observations. It runs in time O(Tn) given a sequence of T observations from a HMM with n states. Despite significant interest in the problem and prolonged effort by different communities, no known algorithm achieves more than a polylogarithmic speedup. In this paper,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2021
ISSN: 0004-5411,1557-735X
DOI: 10.1145/3449352